Optimal Algorithms for Constrained Recon gurable Meshes
نویسنده
چکیده
This paper introduces a constrained recon gurable mesh model which incorporates practical assump tions about propagation delays on large sized buses Simulations of optimal recon gurable mesh algo rithms on the constrained recon gurable mesh model are found to be non optimal Optimal solutions for the sorting and convex hull problems are then presented For the problems investigated the con strained recon gurable mesh model predicts a con tinuum in performance between the recon gurable mesh and mesh of processors architectures
منابع مشابه
Optimal Algorithms for Constrained Reconfigurable Meshes
This paper introduces a constrained recon gurable mesh model which incorpo rates practical assumptions about propagation delays on large sized buses Sim ulations of AT optimal recon gurable mesh algorithms on the constrained re con gurable mesh model are found to be non optimal Optimal solutions for the sorting and convex hull problems requiring less area are then presented For the problems inv...
متن کاملAdaptive AT 2 optimal algorithms on recon ® gurable meshes q
Recently self-simulation algorithms have been developed to execute algorithms on a recon®gurable mesh (RM) of size smaller than recommended in those algorithms. Optimal slowdown, in self-simulation, has been achieved with the compromise that the resultant algorithms fail to remain AT 2 optimal. In this paper, we introduce, for the ®rst time, the idea of adaptive algorithm which runs on RM of va...
متن کاملConstant-Time Hough Transform on a 3D Reconfigurable Mesh Using Fewer Processors
The Hough transform has many applications in image processing and computer vision, including line detection, shape recognition and range alignment for moving imaging objects. Many constant-time algorithms for computing the Hough transform have been proposed on recon gurable meshes [1, 5, 6, 7, 9, 10]. Among them, the ones described in [1, 10] are the most e cient. For a problem with an N N imag...
متن کاملA Novel Dynamic Task Scheduling Algorithm for Grid Networks with Recon gurable Processors
The incorporation of recon gurable processors in computational grids promises to provide increased performance without compromising exibility. Consequently, grid networks (such as TeraGrid) are utilizing recon gurable computing resources next to general-purpose processors (GPPs) in their computing nodes. The near-optimal utilization of resources in a grid network considerably depends on the app...
متن کاملAdaptive at 2 Optimal Algorithms
RECONFIGURABLE MESHES M. MANZUR MURSHED RICHARD P. BRENT Comp. Sci. Lab, The Australian National University Oxford University Computing Laboratory Canberra ACT 0200, Australia Oxford, OX1 3QD, U.K. [email protected] [email protected] ABSTRACT Recently self-simulation algorithms have been developed to execute algorithms on a recon gurable mesh (RM) of size smaller than recomme...
متن کامل